Variational Analysis in Semi-Infinite and Infinite Programming, II: Necessary Optimality Conditions

This paper concerns applications of advanced techniques of variational analysis and generalized differentiation to problems of semi-infinite and infinite programming with feasible solution sets defined by parameterized systems of infinitely many linear inequalities of the type intensively studied in the preceding development [5) from our viewpoint of robust Lipschitzian stability. We present meaningful interpretations and practical examples of such models. The main results establish necessary optimality conditions for a broad class of semi-infinite and infinite programs, where objectives are generally described by nonsmooth and nonconvex functions on Banach spaces and where infinite constraint inequality systems are indexed by arbitrary sets. The results obtained are new in both smooth and nonsmooth settings of semi-infinite and infinite programming.